Edge Length Interpolation
نویسندگان
چکیده
We propose a scheme to interpolate between a set of two or more 3-dimensional triangulated meshes with corresponding connectivity. The principle behind this is that meshes, when viewed as vectors of edge lengths, can be seen as points in a Euclidean shape space. Within this space, mesh interpolation corresponds to traversing straight lines between points, and due to the Euclidean structure of the underlying shape space, we can easily take averages and perform statistical shape analysis. We perform experiments in three important applications to illustrate these ideas. First, we demonstrate interpolation between various shapes and poses. Second, we illustrate statistical analysis on a large dataset of faces, calculating mean shapes and exploring new shapes by moving along the principal modes of variance of the dataset. Finally, we visualize morphs corresponding to conformal mappings, an important class of deformations, which form a subspace of the edge-length space.
منابع مشابه
Metric construction by length distribution tensor and edge based error for anisotropic adaptive meshing
Metric tensors play a key role to control the generation of unstructured anisotropic meshes. In practice, the most well established error analysis enables to calculate a metric tensor on an element basis. In this paper, we propose to build a metric field directly at the nodes of the mesh for a direct use in the meshing tools. First, the unit mesh metric is defined and well justified on a node b...
متن کاملApproximate Tangent Vector and Geometric Cubic Hermite Interpolation
In this paper we introduce a discrete tangent vector of a polygon defined on each vertex by a linear combination of forward difference and backward difference, and show that if the polygon is originated from a smooth curve then direction of the discrete tangent vector is a second order approximation of the direction of the tangent vector of the original curve. Using this discrete tangent vector...
متن کاملPerformance Evaluation of Edge-Directed Interpolation Methods for Images
Many interpolation methods have been developed for high visual quality, but fail for inability to preserve image structures. Edges carry heavy structural information for detection, determination and classification. Edge-adaptive interpolation approaches become a center of focus. In this paper, performance of four edge-directed interpolation methods comparing with two traditional methods is eval...
متن کاملThe Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to the portion of the triangulation within a cube of side n1/d. For d equal to two, we calculate the expected maximum edge length, the expected minimum and maximum angles, and the average aspect ratio of a triangle. We al...
متن کاملImage Enlargement by Applying Coordinate Rotation and Kernel Stretching to Interpolation Kernels
Conventional image interpolation methods such as the bilinear and bicubic algorithms determine the weights of the reference pixels based on the special distance between the supplementary pixel and the reference pixels. They suffer from some problems such as blurring and jagging around the edges since the edge structure is not considered in interpolation. In this paper, a coordinate rotation and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015